in Theory and Pra ti e of Logi Programming 1 HTN Planning in Answer Set

A epted for publi ation in Theory and Pra ti e of Logi Programming 1 HTN Planning in Answer Set ProgrammingJ

Theory and Pra ti e of Logi Programming 1 Properties of Input - Consuming

Theory and Pra ti e of Logi Programming

Global Induction Mechanisms in a Μ - Calculus with Explicit Approximations ∗

Will be set by the publisher Informatique Théorique et Appli ations ON GLOBAL INDUCTION MECHANISMS IN A μ-CALCULUS WITH EXPLICIT APPROXIMATIONS ∗ Christoph Sprenger1 and Mads Dam2 Abstra t. We investigate a Gentzen-style proof system for the rstorder μal ulus based on y li proofs, produ ed by unfolding xed point formulas and dete ting repeated proof goals. Our system uses expli it ordinal varia...

Planning in Answer Set Programming Using Ordered Task Decomposition

In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is an adaptation of Hierarchical Task Network (HTN) planning, an approach that has led to some very efficient planners. The ASP paradigm evolved out of the stable semantics for logic programs in recent years and is strongly relat...